Primal-dual fast gradient method with a model
نویسندگان
چکیده
منابع مشابه
A fast primal-dual method for generalized Total Variation denoising
Total Variation denoising, proposed by Rudin, Osher and Fatemi in [22], is an image processing variational technique that has attracted considerable attention in the past fifteen years. It is an advantageous technique for preserving image edges but tends to sharpen excessively smooth transitions. With the purpose of alleviating this staircase effect some generalizations of Total Variation denoi...
متن کاملThe Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
This paper deals with the analysis of a recent reformulation of the primal-dual hybrid gradient method, which allows one to apply it to nonconvex regularizers. Particularly, it investigates variational problems for which the energy to be minimized can be written as G(u) + F (Ku), where G is convex, F is semiconvex, and K is a linear operator. We study the method and prove convergence in the cas...
متن کاملDual-Primal FETI Method
The FETI algorithms are numerically scalable iterative domain decomposition methods. These methods are well documented for solving equations arising from the Finite Element discretization of second or fourth order elasticity problems. The one level FETI method equipped with the Dirichlet preconditioner was shown to be numerically scalable for second order elasticity problems while the two level...
متن کاملFaster PET reconstruction with a stochastic primal-dual hybrid gradient method
Image reconstruction in positron emission tomography (PET) is computationally challenging due to Poisson noise, constraints and potentially non-smooth priors—let alone the sheer size of the problem. An algorithm that can cope well with the first three of the aforementioned challenges is the primal-dual hybrid gradient algorithm (PDHG) studied by Chambolle and Pock in 2011. However, PDHG updates...
متن کاملA primal-dual hybrid gradient method for non-linear operators with appli- cations to MRI
We study the solution of minimax problems minx maxy G(x) + 〈K(x), y〉 − F ∗(y) in finite-dimensional Hilbert spaces. The functionals G and F ∗ we assume to be convex, but the operator K we allow to be nonlinear. We formulate a natural extension of the modified primal-dual hybrid gradient method (PDHGM), originally for linear K, due to Chambolle and Pock. We prove the local convergence of the met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Research and Modeling
سال: 2020
ISSN: 2076-7633,2077-6853
DOI: 10.20537/2076-7633-2020-12-2-263-274